Floats & Ropes: a case study for formal numerical program veri cation
نویسنده
چکیده
We present a case study of a formal veri cation of a numerical program that computes the discretization of a simple partial di erential equation. Bounding the rounding error was tricky as the usual idea, that is to bound the absolute value of the error at each step, fails. Our idea is to nd out a precise analytical expression that cancels with itself at the next step, and to formally prove the correctness of this approach.
منابع مشابه
Behavioral Interface Speci cation Languages
Behavioral interface speci cation languages allow programmers to express the intended behavior of programs such as functional behavior and resource consumption. Formal speci cations of program behavior is useful for precise documentation, for the generation of test cases and test oracles, for debugging, and for formal program veri cation. In this paper, we survey behavioral interface speci cati...
متن کاملParallel Program Development for a Recursive Numerical Algorithm a Case Study
A systematic approach to the parallel program development for a new class of numerical methods on sparse grids is presented It combines formal design and veri cation methods based on stream processing functions with simple tools for e ciency evaluation The use of this approach is demonstrated on a real life example two dimensional integration algorithm
متن کاملExtending the reach and power of deductive program verification
Soware is vital for modern society. e ecient development of correct and reliable soware is of ever-growing importance. An important technique to achieve this goal is deductive program verication: the construction of logical proofs that programs are correct. In this thesis, we address three important challenges for deductive verication on its way to a wider deployment in the industry: 1. ve...
متن کاملA Method of Veri cation in Design : an operating system case study
This paper reports a study of veri cation in the high-level design phase of operating system development in which both rigorous and formal veri cation are used, where the rigorous argument is used to determine a manageable formal proof to be carried out. A 2-sorted rst order temporal language is used to express several possible high-level designs and the required properties of an operating syst...
متن کاملProviding a Formal Linkage between the MDG Veri cation System and HOL Proof System
We describe an approach for formally linking a symbolic state enumeration system and a theorem proving system based on a veri ed version of the former. It has been realized using the HOL system and a simpli ed version of the MDG system. It involves the following three steps. Firstly, we have veri ed aspects of correctness of a simpli ed version of the MDG system. We have made certain that the s...
متن کامل